Variable declarations in natural deduction
نویسنده
چکیده
We propose the use of variable declarations in natural deduction. A variable declaration is a line in a derivation that introduces a new variable into the derivation. Semantically, it can be regarded as declaring that the variable denotes an element of the universe of discourse. Undeclared variables, in contrast, do not denote anything, and may not occur free in any formula in the derivation. Although most natural deduction systems in use today do not have variable declarations, the idea can be traced back to one of the first papers on natural deduction. We show how the use of variable declarations in natural deduction leads to a formal system that has a number of desirable features: It is simple, easy to use and understand, and corresponds closely to ordinary informal reasoning. Soundness and completeness of the system are easily proven. Furthermore, the system clarifies the role of the existential instantiation rule in natural deduction. c © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Uniication in a Sorted -calculus with Term Declarations and Function Sorts
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing search spaces. This suggests that sort information can be employed in higher-order theorem proving with similar results. This paper develops a sorted-calculus suitable for automatic theorem proving applications. It extends the simply typed-...
متن کاملSur la validité des schémas de bases de données
Les mises a j o u r (Tun schema de base de donnees peuvent porter sur ses trois Const i tuante , ( l ) les declarations de structures, (2) les regies de coherence (et de deduction) et (3) les transactions. Ces Const i tuante doivent verif ier certaines proprietes, de f in issant les Schemas valides. U n Systeme de gestion de Schemas do i t pouvoir verifier la val id i te des sche"mas ( i n d e ...
متن کاملA Programming Tool for Management of a Predicate-Calculus-Oriented Data Base
This paper describes a LISP program, cal led PCDB, for storage and re t r i eva l in a data base of predicate calculus (PC) formulas. The PCDB pacxage uses standardized representations of PC formulas, where ground unit clauses are stored e f f i c i e n t l y , e.g. on the proper tyl is ts of t he i r arguments, and other clauses have other representation. The major part of the PCDB package is ...
متن کاملHigher-Order Order-Sorted Resolution
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...
متن کاملUniication in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
We develop an order-sorted higher-order calculus suitable for automatic theorem proving applications by extending the extensional simply typed lambda calculus with a higher-order ordered sort concept and constant overloading. Huet's well-known techniques for unifying simply typed lambda terms are generalized to arrive at a complete transformation-based uniication algorithm for this sorted calcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 144 شماره
صفحات -
تاریخ انتشار 2006